-
1 branch-bound algorithm
testing algorithm — алгоритм тестирования; алгоритм проверки
simulated annealing algorithm — алгоритм модельной "закалки"
-
2 branch-bound algorithm
Большой англо-русский и русско-английский словарь > branch-bound algorithm
-
3 branch-bound algorithm
Вычислительная техника: алгоритм метода ветвей и границУниверсальный англо-русский словарь > branch-bound algorithm
-
4 branch-bound algorithm
English-Russian dictionary of computer science and programming > branch-bound algorithm
-
5 branch-and-bound algorithm
branch-and-bound algorithm Verzweigungsalgorithmus m (Programmierung)English-German dictionary of Electrical Engineering and Electronics > branch-and-bound algorithm
-
6 branch bound
-
7 branch bound
-
8 branch and bound algorithm
English-Russian dictionary of Information technology > branch and bound algorithm
-
9 branch-and-bound algorithm
Большой англо-русский и русско-английский словарь > branch-and-bound algorithm
-
10 branch-and-bound algorithm
Англо-русский словарь технических терминов > branch-and-bound algorithm
-
11 branch and bound algorithm
1) Компьютерная техника: метод ветвей и границ2) Вычислительная техника: алгоритм ветвей и границ3) Микроэлектроника: алгоритм метода ветвей и границ4) Макаров: метод ветвей и границ (метод оптимизации)Универсальный англо-русский словарь > branch and bound algorithm
-
12 branch-and-bound algorithm
1) Техника: алгоритм метода ветвей и границ2) Математика: алгоритм ветвей и границ (метода)Универсальный англо-русский словарь > branch-and-bound algorithm
-
13 branch and bound algorithm
алгоритм методу гілок і меж (для синтезу логічних і принципових схем ВІС)English-Ukrainian dictionary of microelectronics > branch and bound algorithm
-
14 branch and bound algorithm
English-Russian electronics dictionary > branch and bound algorithm
-
15 branch and bound algorithm
The New English-Russian Dictionary of Radio-electronics > branch and bound algorithm
-
16 branch and bound algorithm
s algorisme de branca i límitDef. del Termcat: Algorisme de recerca en arbre utilitzat especialment en programació que, mitjançant una funció heurística, desenvolupa el nus situat al camí més curt del graf a fi d'optimar resultats.Nota: S'utilitza especialment en programació. -
17 branch and bound algorithm
Англо-русский словарь компьютерных и интернет терминов > branch and bound algorithm
-
18 branch and bound algorithm
English-Russian dictionary of terms that are used in computer games > branch and bound algorithm
-
19 branch-and-bound algorithm
English-Russian scientific dictionary > branch-and-bound algorithm
-
20 branch and bound algorithm
n COMP Verzweigungsalgorithmus mDictionary English-German Informatics > branch and bound algorithm
- 1
- 2
См. также в других словарях:
Branch and bound — (BB) is a general algorithm for finding optimal solutions of various optimization problems, especially in discrete and combinatorial optimization. It consists of a systematic enumeration of all candidate solutions, where large subsets of… … Wikipedia
Branch and cut — (sometimes written as branch and cut ) is a method of combinatorial optimization for solving integer linear programs, that is, linear programming problems where some or all the unknowns are restricted to integer values. The method is a hybrid of… … Wikipedia
Branch-and-Bound — (Verzweigung und Schranke) ist eine im Bereich Operations Research häufig verwendete mathematische Methode, deren Ziel darin besteht, für ein gegebenes ganzzahliges Optimierungsproblem eine beste Lösung zu finden. Branch and Bound führt auf einen … Deutsch Wikipedia
Branch and Bound — (Verzweigung und Schranke) ist eine im Bereich Operations Research häufig verwendete mathematische Methode, deren Ziel darin besteht, für ein gegebenes ganzzahliges Optimierungsproblem eine beste Lösung zu finden. Branch and Bound führt auf einen … Deutsch Wikipedia
Branch and bound — (Verzweigung und Schranke) ist eine im Bereich Operations Research häufig verwendete mathematische Methode, deren Ziel darin besteht, für ein gegebenes ganzzahliges Optimierungsproblem eine beste Lösung zu finden. Branch and Bound führt auf einen … Deutsch Wikipedia
Branch and price — est une méthode d optimisation combinatoire pour résoudre des problèmes d optimisation linéaire en nombres entiers. Cette méthode combine l algorithme du branch and bound classique avec une génération de colonnes à chaque nœud de l arbre.… … Wikipédia en Français
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Criss-cross algorithm — This article is about an algorithm for mathematical optimization. For the naming of chemicals, see crisscross method. The criss cross algorithm visits all 8 corners of the Klee–Minty cube in the worst case. It visits 3 additional… … Wikipedia
Levenberg–Marquardt algorithm — In mathematics and computing, the Levenberg–Marquardt algorithm (LMA)[1] provides a numerical solution to the problem of minimizing a function, generally nonlinear, over a space of parameters of the function. These minimization problems arise… … Wikipedia
Gauss–Newton algorithm — The Gauss–Newton algorithm is a method used to solve non linear least squares problems. It can be seen as a modification of Newton s method for finding a minimum of a function. Unlike Newton s method, the Gauss–Newton algorithm can only be used… … Wikipedia
Knuth–Morris–Pratt algorithm — The Knuth–Morris–Pratt string searching algorithm (or KMP algorithm) searches for occurrences of a word W within a main text string S by employing the observation that when a mismatch occurs, the word itself embodies sufficient information to… … Wikipedia
